نتایج جستجو برای: subalgebra membership problem
تعداد نتایج: 902784 فیلتر نتایج به سال:
We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
The subalgebra membership problem is the problem of deciding if a given element belongs to an algebra given by a set of generators. This is one of the best established computational problems in algebra. We consider a variant of this problem, which is motivated by recent progress in the Constraint Satisfaction Problem, and is often referred to as the Subpower Membership Problem (SMP). In the SMP...
A completion procedure for computing a canonical basis for a k-subalgebra is proposed. Using this canonical basis, the membership problem for a k-subalgebra can be solved. The approach follows Buchberger's approach for computing a Grr obner basis for a polynomial ideal and is based on rewriting concepts. A canonical basis produced by the completion procedure shares many properties of a Grr obne...
Given tuples a1, . . . , ak and b in A n for some algebraic structure A, the subpower membership problem asks whether b is in the subalgebra of An that is generated by a1, . . . , ak . For A a finite group, there is a folklore algorithm which decides this problem in time polynomial in n and k. We show that the subpower membership problem for any finite Mal’cev algebra is in NP and give a polyno...
In this paper, we apply the concept of t-norm T to fuzzy structure of B-algebras. The notion of a fuzzy B-subalgebra of B-algebras with respect to t-norm is introduced and several related properties are investigated. The direct product and T -product of T -fuzzy subalgebra of B-algebra is investigated.
In this paper some properties of the uniformity topology on a BCI-algebras are discussed. Keywords—(Fuzzy) ideal, (Fuzzy) subalgebra, Uniformity, clopen sets.
We introduce the notion of sensible fuzzy ideals of BCK-algebras with respect to a t-conorm and investigate some of their properties. We give the conditions for a sensible fuzzy subalgebra with respect to a t-conorm to be a sensible fuzzy ideal with respect to a t-conorm. Some properties of the direct product and S-product of fuzzy ideals of BCK-algebras with respect to a t-conorm are also disc...
The Ideal Membership Problem is as follows: given f0, f1, . . . , fm ∈ K[x1, . . . , xn], is f0 ∈ 〈f1, . . . , fm〉, where 〈f1, . . . , fm〉 denotes the ideal generated by the fi? An equivalent formulation is: are there q1, . . . , qm ∈ K[x1, . . . , xn] such that f0 = ∑m i=1 qifi? We will solve this question by using Gröbner bases. That is, a Gröbner basis is a “nice” representation of an ideal,...
In dictionary/membership problem, we want to keep a set S of n items from a universe U with possibly some extra information associated with each one of them. For the membership problem, the goal is to create a data structure that allows us to ask whether a given item x is in S or not. For a dictionary, the data structure should also return the information associated with x. For example, S can b...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید